Presenting the Aims Data — Some Trade-Offs
نویسندگان
چکیده
منابع مشابه
Some Evidence on Trade-offs and Sorting
Wages or Fringes? Some Evidence on Trade-offs and Sorting The two key predictions of hedonic wage theory are that there is a trade-off between wages and nonmonetary rewards and that the latter can be used as a sorting device by firms to attract and retain the kind of employees they desire. Empirical analysis of these topics are scarce as they require detailed data on all monetary as well as non...
متن کاملTestability Trade-Offs for BIST Data Paths
Power dissipation during test application is an emerging problem due to yield and reliability concerns. This paper focuses on BIST for RTL data paths and discusses testability trade-offs in terms of test application time, BIST area overhead and power dissipation.
متن کاملData compression trade-offs in sensor networks
This paper first discusses the need for data compression within sensor networks and argues that data compression is a fundamental tool for achieving trade-offs in sensor networks among three important sensor network parameters: energy-efficiency, accuracy, and latency. Next, it discusses how to use Fisher information to design data compression algorithms that address the trade-offs inherent in ...
متن کاملTrade-offs
23. Stent, G.S. (1972). Prematurity and uniqueness in scientific discovery. Sci. Am. 227, 84–93. 24. Mirsky, A.E., and Pollister, A.W. (1946). Chromosin, a desoyribose nucleoprotein complex of the cell nucleus. J. Gen. Physiol. 30, 117–148. 25. Boivin, A. (1947). Directed mutation in colon bacilli, by an inducing principle of desoxyribonucleic nature: Its meaning for the general biochemistry of...
متن کاملSpace-time trade-offs for some ranking and searching queries
We study space/time tradeoffs for querying some combinatorial structures. In the first, given an arrangement of n lines in general position in the plane, a query for a real number t asks about Rank(t), the number of vertices of the arrangement with x-coordinates ≤ t. We show that for K = O(n/logn), after a preprocessing step that uses space S = O(n/(K logK)) the query can be answered in time O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anaesthesia and Intensive Care
سال: 1993
ISSN: 0310-057X,1448-0271
DOI: 10.1177/0310057x9302100505